A N Efficient Eigenvector-node Interchange Approach for Finding Netlist Partitions

graph G and applying the eigenvector technique of Barnes 111 to partition the graph G into IC blocks of fixed module . size. An efficient generalization of the Fiduccia-Mattheyses node interchange heuristic is developed to further reduce the number of nets connecting k blocks [3]. This node interchange heuristic is tested on the one resulting netlist partition obtained by this new eigenvector approach on a variety of small to large sized benchmark netlist partitioning problems (between 200 to 12,000 modules and nets). The test results show that this novel eigenvectornode interchange approach yields netlist partitions that are competitive with the best netlist partitions obtained by using node interchange heuristics alone on many random initial netlist partitions. The running time of this method is a small fraction of previous node interchange met hods.